Three-Dimensional Array-Based Group Testing Algorithms
نویسندگان
چکیده
منابع مشابه
Three Dimensional Graphics Algorithms on theMicro - Grain Array Processor - IIBenjamin
Three-dimensional graphics processors play a central role in many modern computer systems due to the large demand for entertainment, visual-ization tools, architectural CAD tools, and physical modeling. But high performance graphics subsystems are just beginning to reach the commercial workstation and personal computer markets. They also remain high priced and often lacking the performance need...
متن کاملThree-Dimensional Surface Recognition Based on Genetic Algorithms
A robust method for 3-D surface recognition based on genetic algorithms is proposed in this paper. With the help of a specilic least square fitting algorithm, the model-based 3-1) st,rfacc recognition problem is first converted into an optimization problem. Then. a genetic algorithm is used to solve the optimal problem in order to extract general quadric surfaces. Finally. all the extracted .~u...
متن کاملThree Dimensional Parallel Thinning Algorithms based on P -simple Points
A simple point of an object is a point whose removal does not change the topology. However, the simultaneous deletion of simple points may change the topology. Through the notion of P -simple point, we give examples of algorithms, described by a two-steps procedure, which removes simple points in parallel and which are automatically ensured to preserve the topology. More particularly, a new sym...
متن کاملNoisy Adaptive Group Testing: Bounds and Algorithms
The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and many more. One of the defining features of the group testing problem is the distinction between the non-adaptive and adaptive settings: In the...
متن کاملEfficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
In the k-junta testing problem, a tester has to efficiently decide whether a given function f : {0, 1} → {0, 1} is a kjunta (i.e., depends on at most k of its input bits) or is ε-far from any k-junta. Our main result is a quantum algorithm for this problem with query complexity Õ( √ k/ε) and time complexity Õ(n √ k/ε). This quadratically improves over the query complexity of the previous best q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biometrics
سال: 2008
ISSN: 0006-341X
DOI: 10.1111/j.1541-0420.2008.01158.x